Crafting tool support for teaching Hoare logic
نویسنده
چکیده
Currently, software certification and verification is perceived as overly difficult and hard to understand task in program development. This image can be changed through effective instruction of prospect programmers during their studies. Teaching Hoare logic is a process that can be made significantly easier if appropriate tools are employed. Having an environment tailored to the style and content of a particular lecture is especially beneficial. We argue that current state of related technology is such that it is possible to implement a customised tool with acceptable effort. We illustrate our point by showing selected aspects of the implementation of one such application, which we call HAHA (Hoare Advanced Homework Assistant).
منابع مشابه
Contour Crafting Process Plan Optimization Part I: Single-Nozzle Case
Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...
متن کاملContour Crafting Process Plan Optimization Part II: Multi–Machine Cases
Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...
متن کاملHoare Logic with Updates A Hoare-Style Calculus with Explicit State Updates
We present a verification system for a variant of Hoare-logic that supports proving program correctness by forward symbolic execution. No explicit weakening rules are needed and first-order reasoning is automated. The system is suitable for teaching program verification, because the student can concentrate on reasoning about programs following their natural control flow and proofs are machine-c...
متن کاملA Termination Checker for Isabelle Hoare Logic
Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only satisfies its preand post-conditions but also terminates. We have implemented a termination checker for Isabelle’s Hoare logic. The tool can be used as an oracle, where Isabelle accepts its claim of termination. The tool can a...
متن کاملA Hoare-Style Calculus with Explicit State Updates
We present a verification system for a variant of Hoare-logic that supports proving by forward symbolic execution. In addition, no explicit weakening rules are needed and first-order reasoning is automated. The system is suitable for teaching program verification, because the student can concentrate on reasoning about programs following their natural control flow and proofs are machine-checked.
متن کامل